A Characterization of the Language Classes Learnable with Correction Queries
نویسندگان
چکیده
Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was introduced. The aim of this paper is to make a further step towards the understanding of the classes of languages learnable with correction queries. We characterize these classes in terms of triples of definite finite tell-tales. This result allowed us to show that learning with correction queries is strictly more powerful than learning with membership queries, but weaker than the model of learning in the limit from positive data.
منابع مشابه
Learning Balls of Strings from Edit Corrections
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually defined by complex grammatical mechanisms for which the learning results are predominantly negative, as the few algorithms are not really able to cope with noise. On the other hand, the learning settings themselves re...
متن کاملThe Complexity of Exactly Learning
In this paper, we investigate the complexity of exact-learning classes of permutation groups and linear spaces over nite elds. These concept classes can be seen as special subclasses of the concept class of circuits. It turns out that in Angluin's exact-learning model these concept classes are learnable with equivalence queries but not learnable with membership queries, indeed not even exact le...
متن کاملMonotone term decision lists
We introduce a new representation class of Boolean functions|monotone term decision lists|which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. We study the learnability of monotone term decision l...
متن کاملTitle : On the Learnability of Counting Functions
We examine the learnability of concepts based on counting functions. A counting function is a generalization of a parity function in which the weighted sum of n inputs is tested for equivalence to some value k modulo N . The concepts we study therefore generalize many commonly studied boolean functions. We first show that disjunctions of counting functions (DOCFs) with modulus N are learnable b...
متن کاملEfficient Learning of Ordered Tree Patterns with Internal Structured Variables
We show that some foundamental classes of ordered tree pattern languages are polynomial time inductively inferable from positive data and exactly learnable in polynomial time using queries. We report experimental results on applying our learnining method to a collection of tree structured data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007